Search for Superconducting Hydrogen Compounds by Evolutionary Techniques
نویسندگان
چکیده
منابع مشابه
New superconducting and semiconducting Fe-B compounds predicted with an ab initio evolutionary search.
New candidate ground states at 1:4, 1:2, and 1:1 compositions are identified in the well-known Fe-B system via a combination of ab initio high-throughput and evolutionary searches. We show that the proposed oP12-FeB2 stabilizes by a break up of 2D boron layers into 1D chains while oP10-FeB4 stabilizes by a distortion of a 3D boron network. The uniqueness of these configurations gives rise to a ...
متن کاملMultiobjective Local Search Techniques for Evolutionary Polygonal Approximation
Polygonal approximation is based on the division of a closed curve into a set of segments. This problem has been traditionally approached as a single-objective optimization issue where the representation error was minimized according to a set of restrictions and parameters. When these approaches try to be subsumed into more recent multi-objective ones, a number of issues arise. Current work suc...
متن کاملAn Optimal Design Approach for Resistive and Inductive Superconducting Fault Current Limiters via MCDM Techniques
The design process of a superconducting current limiter (SFCL) requires simulation and definition of its electrical, magnetic and thermal properties in form of equivalent circuits and mathematical models. However, any change in SFCL parameters: dimension, resistance, and operating temperature can affect the limiting mode, quench time, and restore time. In this paper, following the simulation of...
متن کاملMolecular replacement by evolutionary search.
Stochastic search algorithms can be used to perform rapid six-dimensional molecular-replacement searches. A molecular-replacement procedure has been developed that uses an evolutionary algorithm to simultaneously optimize the orientation and position of a search model in a unit cell. Here, the performance of this algorithm and its dependence on search model quality and choice of target function...
متن کاملAdversarial Search by Evolutionary Computation
In this paper, we consider the problem of finding good next moves in two-player games. Traditional search algorithms, such as minimax and alpha-beta pruning, suffer great temporal and spatial expansion when exploring deeply into search trees to find better next moves. The evolution of genetic algorithms with the ability to find global or near global optima in limited time seems promising, but t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: THE REVIEW OF HIGH PRESSURE SCIENCE AND TECHNOLOGY
سال: 2017
ISSN: 0917-639X,1348-1940
DOI: 10.4131/jshpreview.27.213